Compiling path expressions into VLSI circuits

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Compiling Esterel into Better Circuits

Producing efficient circuits from a high-level language such as Esterel remains a problem. Sparse state coding requires many more latches used than minimum and waste of reachable state space, while tight state encoding produces slow circuits due to the cost of encoding and decoding. This paper presents an algorithm to generate small and fast circuitry for Esterel. There are three main parts of ...

متن کامل

Compiling Path Queries

Measuring the flow of traffic along network paths is crucial for many management tasks, including traffic engineering, diagnosing congestion, and mitigating DDoS attacks. We introduce a declarative query language for efficient path-based traffic monitoring. Path queries are specified as regular expressions over predicates on packet locations and header values, with SQLlike “groupby” constructs ...

متن کامل

Partitioning VLSI Circuits

Partitioning is a critical area of VLSI CAD. In order to build complex digital logic circuits it is often essential to sub-divide a circuit into smaller parts.Circuit partitioning plays an important role in physical design automation of very large scale integration(VLSI)chips.In VLSI.In VLSI circuit partitioning the problem of obtaining minimum cut is of prime importance.To enhance other criter...

متن کامل

Compiling Regular Expressions to Extract Legal Modifications

In this paper we present a prototype for automatically identifying and classifying types of modifications in Italian legal text. The prototype is part of the Eunomos system, a legal knowledge management service that integrates and makes available legislation from various sources, while finding definitions and explanations of legal concepts in a given context. The design of the prototype is grou...

متن کامل

Compiling Ruby into FPGAs

This paper presents an overview of a prototype hardware compiler which compiles a design expressed in the Ruby language into FPGAs. The features of two important modules, the reenement module and the oorplanning module, are discussed and illustrated. Target code can be produced in various formats, including device-speciic formats such as XNF or CFG, and device-independent formats such as VHDL. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Distributed Computing

سال: 1986

ISSN: 0178-2770,1432-0452

DOI: 10.1007/bf01661169